翻訳と辞書 |
Judy array In computer science and software engineering, a Judy array is a data structure that has high performance, low memory usage and implements an associative array. Unlike normal arrays, Judy arrays may be sparse, that is, they may have large ranges of unassigned indices. They can be used for storing and looking up values using integer or string keys. The key benefits of using a Judy array is its scalability, high performance, memory efficiency and ease of use.〔http://packages.debian.org/wheezy/libjudy-dev〕 Judy arrays are both speed- and memory-efficient , and therefore they can sometimes replace common in-memory dictionary implementations (like red-black trees or hash tables). Roughly speaking, Judy arrays are highly optimised 256-ary radix trees.〔Alan Silverstein, "(Judy IV Shop Manual )", 2002〕 Judy arrays use over 20 different compression techniques on trie nodes to reduce memory usage. The Judy array was invented by Douglas Baskins and named after his sister.〔http://judy.sourceforge.net/〕 ==Benefits==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Judy array」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|